package Examin.WangYi;

import java.util.ArrayList;
import java.util.Scanner;

public class Second {

    static ArrayList<ArrayList<Integer>> paths = new ArrayList<>();
    static ArrayList<Integer> path = new ArrayList<Integer>();
    static int n;
    static int k;
    static int x;
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.nextLine();
        String[] s1 = s.split(" ");
        n = Integer.parseInt(s1[0]);
        k = Integer.parseInt(s1[1]);
        x = Integer.parseInt(s1[2]);
        dfs(1,0);
        if(paths.size()==0){
            System.out.println(-1);
        }else{
            ArrayList<Integer> integers = paths.get(0);
            for (int i = 0; i < integers.size(); i++) {
                System.out.print(integers.get(i));
                if(i!=integers.size()-1){
                    System.out.print(" ");
                }
            }
        }
    }

    static private void dfs(int start, int sum){
        if(sum==x && path.size()==n){
            paths.add(new ArrayList<>(path));
            return;
        }
        for(int i=start;i<=k;i++){
            path.add(i);
            dfs(i+1,sum+i);
            path.remove(path.size()-1);
        }
    }
}
